A Combinatorial Property of Ideals in Free Profinite Monoids

نویسنده

  • BENJAMIN STEINBERG
چکیده

The second statement of Corollary 3 was first proved by Almeida and Volkov using techniques coming from symbolic dynamics [2]. Our next result generalizes a result of Rhodes and the author showing that all elements of finite order in F̂V(A) are group elements, which played a key role in proving that such elements are in fact idempotent [7]. Let N̂ denote the profinite completion of the monoid of natural numbers; it is in fact a profinite semring. We use ω for the non-zero idempotent of N̂.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Asymptotic behaviour of associated primes of monomial ideals with combinatorial applications

Let  $R$ be a commutative Noetherian ring and $I$ be an ideal of $R$. We say that $I$ satisfies the persistence property if  $mathrm{Ass}_R(R/I^k)subseteq mathrm{Ass}_R(R/I^{k+1})$ for all positive integers $kgeq 1$, which $mathrm{Ass}_R(R/I)$ denotes the set of associated prime ideals of $I$. In this paper, we introduce a class of square-free monomial ideals in the polynomial ring  $R=K[x_1,ld...

متن کامل

The Geometry of Profinite Graphs with Applications to Free Groups and Finite Monoids

We initiate the study of the class of profinite graphs Γ defined by the following geometric property: for any two vertices v and w of Γ, there is a (unique) smallest connected profinite subgraph of Γ containing them; such graphs are called tree-like. Profinite trees in the sense of Gildenhuys and Ribes are tree-like, but the converse is not true. A profinite group is then said to be dendral if ...

متن کامل

Rational Codes and Free Profinite Monoids

It is well known that clopen subgroups of finitely generated free profinite groups are again finitely generated free profinite groups. Clopen submonoids of free profinite monoids need not be finitely generated nor free. Margolis, Sapir and Weil proved that the closed submonoid generated by a finite code (which is in fact clopen) is a free profinite monoid generated by that code. In this note we...

متن کامل

-torsion free Acts Over Monoids

In this paper firt of all we introduce a generalization of torsion freeness of acts over monoids, called -torsion freeness. Then in section 1 of results we give some general properties and in sections 2, 3 and 4 we give a characterization of monoids for which this property of their right Rees factor, cyclic and acts in general  implies some other properties, respectively.

متن کامل

On Profinite Uniform Structures Defined by Varieties of Finite Monoids

This paper arose during the preparation of [11], a paper on pro-p topologies extending the results of [12]. After recollecting various assertions on profinite topologies, we tried to improve existing statements and to arrange our notes into a readable form. We soon realized that many results were spread out in the literature, some of them not being stated in the way we wished and some other one...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008